首页> 外文OA文献 >On online energy harvesting in multiple access communication systems
【2h】

On online energy harvesting in multiple access communication systems

机译:关于多址通信系统中的在线能量收集

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We investigate performance limits of a multiple access communication systemwith energy harvesting nodes where the utility function is taken to be thelong-term average sum-throughput. We assume a causal structure for energyarrivals and study the problem in the continuous time regime. For this setting,we first characterize a storage dam model that captures the dynamics of abattery with energy harvesting and variable transmission power. Using thismodel, we next establish an upper bound on the throughput problem as a functionof battery capacity. We also formulate a non-linear optimization problem todetermine optimal achievable power policies for transmitters. Applying acalculus of variation technique, we then derive Euler-Lagrange equations asnecessary conditions for optimum power policies in terms of a system of coupledpartial integro-differential equations (PIDEs). Based on a Gauss-Seidelalgorithm, we devise an iterative algorithm to solve these equations. We alsopropose a fixed-point algorithm for the symmetric multiple access setting inwhich the statistical descriptions of energy harvesters are identical. Alongwith the analysis and to support our iterative algorithms, comprehensivenumerical results are also obtained.
机译:我们研究了具有能量收集节点的多路访问通信系统的性能极限,其中效用函数被视为长期平均吞吐量。我们假设能量到达的因果结构,并研究连续时间范围内的问题。对于此设置,我们首先表征一个蓄水坝模型,该模型利用能量收集和可变的传输功率来捕获电池的动态。使用此模型,我们接下来根据电池容量确定吞吐量问题的上限。我们还制定了非线性优化问题,以确定发射机的最佳可实现功率策略。应用变分微积分技术,然后我们根据耦合的局部积分-微分方程组(PIDEs)的系统,得出了最优功率策略的必要条件Euler-Lagrange方程。基于高斯-塞德尔算法,我们设计了一种迭代算法来求解这些方程。我们还为对称多址设置提出了一种定点算法,其中能量采集器的统计描述是相同的。通过分析并支持我们的迭代算法,还获得了综合的数值结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号